Bounded modified realizability
نویسندگان
چکیده
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The novel form of realizability supports a very general form of the FAN theorem, refutes Markov’s principle but meshes well with some classical principles, including the lesser limited principle of omniscience and weak König’s lemma. We discuss some applications, as well as some previous results in the literature.
منابع مشابه
Proof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modified realizability, namely modified realizability with truth and q-modified realizability. Both variants are shown to be derived from a single “functional interpretation with truth” of intuitionistic linear logic. This analys...
متن کاملOn bounded functional interpretations
A unified view over well-known interpretations of intuitionistic logic, such as Gödel’s dialectica interpretation [6], Diller-Nahm interpretation [1] and Kreisel’s modified realizability [7] was achieved through a parametrised interpretation in the intuitionistic logic context [8] but also, very elegantly, in the linear logic setting (see [10], [9] and [3]). In this talk we report on work in pr...
متن کاملHybrid Functional Interpretations of Linear and Intuitionistic Logic
This article shows how different functional interpretations can be combined into what we term hybrid functional interpretations. These hybrid interpretations work on the setting of a multi-modal linear logic. Functional interpretations of intuitionistic logic can be combined via Girard’s embedding of intuitionistic logic into linear logic. We first show how to combine the usual Kreisel’s modifi...
متن کاملPolynomially Bounded Recursive Realizability
A polynomially bounded recursive realizability, in which the recursive functions used in Kleene’s realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg’s Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primiti...
متن کاملUnifying Functional Interpretations: Past and Future
This article surveys work done in the last six years on the unification of various functional interpretations including Gödel’s dialectica interpretation, its Diller-Nahm variant, Kreisel modified realizability, Stein’s family of functional interpretations, functional interpretations “with truth”, and bounded functional interpretations. Our goal in the present paper is twofold: (1) to look back...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 71 شماره
صفحات -
تاریخ انتشار 2006